Farkas-type results and duality for DC programs with convex constraints
نویسندگان
چکیده
In this paper, we are interested in new versions of Farkas lemmas for systems involving convex and DC-inequalities. These versions extend well-known Farkas-type results published recently, which were used as main tools in the study of convex optimization problems. The results are used to derive several strong duality results such as: Lagrange, Fenchel-Lagrange or Toland-Fenchel-Lagrange duality for DC and convex problems. Moreover, it is shown that for this class of problems, these versions of Farkas lemma are actually equivalent to several strong duality results of Lagrange, Fenchel-Lagrange or TolandFenchel-Lagrange types.
منابع مشابه
A closedness condition and its applications to DC programs with convex constraints
This paper concerns a closedness condition called (CC), requiring a convex function and a convex constrained system. This type of condition has played an important role in the study of convex optimization problems. Our aim is to establish several characterizations of this condition and to apply them to study minimizing problems involving a DC function under a cone-convex constraint and a set co...
متن کاملFarkas-type results for fractional programming problems
Considering a constrained fractional programming problem, within the present paper we present some necessary and sufficient conditions which ensure that the optimal objective value of the considered problem is greater than or equal to a given real constant. The desired results are obtained using the Fenchel-Lagrange duality approach applied to an optimization problem with convex or difference o...
متن کاملSome new Farkas-type results for inequality systems with DC functions
We present some Farkas-type results for inequality systems involving finitely many DC functions. To this end we use the so-called FenchelLagrange duality approach applied to an optimization problem with DC objective function and DC inequality constraints. Some recently obtained Farkas-type results are rediscovered as special cases of our main result.
متن کاملFarkas–type Results for General Composed Convex Optimization Problems with Inequality Constraints
In this paper, we consider a general composed convex optimization problem with inequality systems involving a finite number of convex constraints. We establish the strong duality between the primal problem and the Fenchel-Lagrange dual problem by a conjugate duality approach. Moreover, we obtain some new Farkas-type results for this problem by using weak and strong duality theorems. Our results...
متن کاملFarkas-type results for inequality systems with composed convex functions via conjugate duality
We present some Farkas-type results for inequality systems involving finitely many functions. Therefore we use a conjugate duality approach applied to an optimization problem with a composed convex objective function and convex inequality constraints. Some recently obtained results are rediscovered as special cases of our main result.
متن کامل